package features.advance.nowcoder.huawei;

import java.util.HashMap;
import java.util.Map;

/**
 * @author LIN
 * @date 2022-02-16 18:04
 */
public class Interview02 {
    private static Map<Integer,String> map = new HashMap<>();

    public static void main(String[] args) {
//        Scanner in = new Scanner(System.in);
//        while (in.hasNextInt()) {
//            int a = in.nextInt();
//            int b = in.nextInt();
//
//        }
        int a = -1;
        int b = 2;
        int k[] = new int[b];
        if(a < 0 || b <= 0){
            System.out.println(-1);
            return;
        }
        if(2 * a % b != 0 || (2 * a / b + 1 - b) %2 != 0){
            System.out.println(-1);
            return;
        }
        int k1 = (2 * a / b + 1 - b)/2;
        if(k1 <= 0){
            System.out.println(-1);
            return;
        }
        for (int i = 0; i < b; i++) {
            k[i] = k1++;
            System.out.print(k[i]);
            System.out.print(' ');
        }

    }

    public String recursion(String str){
       return null;

    }
}
